Finite buffer queue with generalized processor sharing and heavy-tailed input processes
نویسندگان
چکیده
منابع مشابه
Finite buffer queue with generalized processor sharing and heavy-tailed input processes
We consider a set of N fluid On–Off flows that share a common server of capacity c and a finite buffer B. The server capacity is allocated using the generalized processor sharing scheduling discipline. Each flow has a minimum service rate guarantee that exceeds its long-term average demand qi. The buffer sharing is unrestricted as long as there is available space. If the buffer is full, the nec...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملNetwork Multiplexer with Generalized Processor Sharing and Heavy-tailed On-Off Flows
We consider a set of fluid On-Off flows that share a common server of capacity c and a finite buffer B. The server capacity is divided using Generalized Processor Sharing scheduling discipline. Each flow has a minimum service rate guarantee that exceeds its long term average demand ρi. The buffer sharing is unrestricted as long as there is available space; if the buffer is full, the necessary a...
متن کاملGeneralized Processor Sharing with Long-Range Dependent Traffic Input
In this paper, we develop an upper bound on the individual session queue length of long range dependent (LRD) traffic under the generalized processor sharing (GPS) scheduling discipline. This work is based on the analysis of the arrival process of LRD traffic, which is demonstrated to be Weibull Bounded Burstiness (W.B.B.) process in our paper. Decomposing GPS system into isolated queues and se...
متن کاملGeneralised Processor Sharing Networks Fed by Heavy-tailed Traffic Flows
We consider networks where traffic is served according to the Generalised Processor Sharing (GPS) principle. GPS-based scheduling algorithms are considered important for providing differentiated quality of service in integrated-services networks. We are interested in the workload of a particular flow i at the bottleneck node on its path. Flow i is assumed to have long-tailed traffic characteris...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Networks
سال: 2002
ISSN: 1389-1286
DOI: 10.1016/s1389-1286(02)00304-3